Irreducible Polynomials of Maximum Weight
نویسندگان
چکیده
We establish some necessary conditions for the existence of irreducible polynomials of degree n and weight n over F2. Such polynomials can be used to efficiently implement multiplication in F2n . We also provide a simple proof of a result of Bluher concerning the reducibility of a certain family of polynomials.
منابع مشابه
Table of Low-Weight Binary Irreducible Polynomials
finite fields, irreducible polynomials A table of low-weight irreducible polynomials over the finite field F2 is presented. For each integer n in the range 2 = n = 10,000, a binary irreducible polynomial f(x) of degree n and minimum posible weight is listed. Among those of minimum weight, the polynomial listed is such that the degree of f(x) – xn is lowest (similarly, subsequent lower degrees a...
متن کاملSymmetry classes of polynomials associated with the dihedral group
In this paper, we obtain the dimensions of symmetry classes of polynomials associated with the irreducible characters of the dihedral group as a subgroup of the full symmetric group. Then we discuss the existence of o-basis of these classes.
متن کاملMultiple Orthogonal Polynomials and a Counterexample to Gaudin Bethe Ansatz Conjecture
Jacobi polynomials are polynomials whose zeros form the unique solution of the Bethe Ansatz equation associated with two sl2 irreducible modules. We study sequences of r polynomials whose zeros form the unique solution of the Bethe Ansatz equation associated with two highest weight slr+1 irreducible modules, with the restriction that the highest weight of one of the modules is a multiple of the...
متن کاملOn the Number of Polynomials of Bounded Height that Satisfy the Dumas Criterion
We study integer coefficient polynomials of fixed degree and maximum height H that are irreducible by the Dumas criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials as H → ∞. We also show that, for a fixed degree, the density of Dumas polynomials in the set of all irreducible integer coefficient polynomials is strictly less than 1.
متن کاملSystematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials
ÐThis paper considers the design of bit-parallel dedicated finite field multipliers using standard basis. An explicit algorithm is proposed for efficient construction of Mastrovito product matrix, based on which we present a systematic design of Mastrovito multiplier applicable to GF 2m generated by an arbitrary irreducible polynomial. This design effectively exploits the spatial correlation ...
متن کامل